Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank
نویسندگان
چکیده
Combining graph theory and linear algebra, we study SAT problems of low “linear algebra complexity”, considering formulas with bounded hermitian rank. We show polynomial time SAT decision of the class of formulas with hermitian rank at most one, applying methods from hypergraph transversal theory. Applications to heuristics for SAT algorithms and to the structure of minimally unsatisfiable clause-sets are discussed.
منابع مشابه
Weighted Transversals of a Hypergraph
We consider a generalization of the notion of transversal to a finite hypergraph, so called weighted transversals. Given a non-negative weight vector assigned to each hyperedge of the input hypergraph, we define a weighted transversal as a minimal vertex set which intersects a collection of hyperedges of sufficiently large total weight. We show that the hypergraph of all weighted transversals i...
متن کاملIdentifying the Minimal Transversals of a Hypergraph and Related Problems
The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset of vertices is contained in or contains some edge of H, is shown to be co-NP-complete. A certain subproble...
متن کاملDual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transversals. We show that for an arbitrary hypergraph the families of multiple and partial transversals are both dual-bounded in the sense that the size of the corresponding dual hypergraph is bounded by a polynomial in the...
متن کاملExact algorithms for finding minimum transversals in rank-3 hypergraphs
We present two algorithms for the problem of nding a minimum transversal in a hypergraph of rank 3, also known as the 3-Hitting Set problem. This problem is a natural extension of the vertex cover problem for ordinary graphs. The rst algorithm runs in time O(1:6538 n) for a hypergraph with n vertices, and needs polynomial space. The second algorithm uses exponential space and runs in time O(1:6...
متن کاملFaster Algorithms to Enumerate Hypergraph Transversals
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph. For each fixed k ≥ 3, our algorithms for hypergraphs of rank k, where the rank is the maximum size of a hyperedge, outperform the previous best. This also implies improved upper bounds on the maximu...
متن کامل